KERALA UNIVERSITY Class 8 graph theory Question Paper 2013

Practice authentic previous year questions for better exam preparation.

Sample Questions

(a) Using the algorithm of Kruskal, find the shortest spanning tree in the following graph.
(b) Which of the following simple graphs have a Hamilton Circuit or if no, a Hamilton Path?
(c) Explain traveling salesman problem. Express the problem in terms of graph terminology.
(a) Prove the graphs $K_{5}$, and $K_{3,3}$ are non-planar.
(b) Explain the steps involved in testing for planarity of graphs. Module - III